AIDA-based Communication for Distributed Time-critical Applications
نویسنده
چکیده
In this paper, we propose a superior technique for distributed time-critical communication using AIDA (Adaptive Information Dispersal Algorithm), a novel elaboration on Michael O. Rabin's IDA [Rabi89]. We show that using a small dynamically-controlled amount of redundancy, stringent timing constraints imposed on periodic as well as sporadic communication requests in a distributed realtime system can be ful lled up to any degree of con dence. AIDA is randomized in the sense that it does not guarantee the ful llment of hard time constraints. Instead, it guarantees a lower bound on the probability of ful lling such constraints. We contrast AIDA with traditional communication scheduling techniques used in conjunction with time-critical application in general, and distributed multimedia systems in particular. The suitability of AIDA-based bandwidth allocation for a variety of time-critical application is established and plans for future research experiments are mentioned. Do not distribute without author's permission
منابع مشابه
AIDA: A Bandwidth Allocation Strategy for Distributed Real-Time Systems
In this paper, we propose a superior technique for distributed time-critical communication using AIDA, a novel elaboration on Michael O. Rabin's IDA 19]. We show that using a small dynamically-controlled amount of redundancy, stringent timing constraints imposed on periodic as well as sporadic communication requests in a distributed real-time system can be fulllled up to any degree of conndence...
متن کاملIn Proceedings of the First IEEE IPPS Workshop on Parallel and Distributed Real - Time Systems , Newport Beach , CA , April 1993 . AIDA
In this paper, we propose a superior technique for distributed time-critical communication using AIDA, a novel elaboration on Michael O. Rabin's IDA A 1 9 ]. We s h o w that using a small dynamically-controlled amount of redundancy, stringent timing constraints imposed on periodic as well as sporadic communication requests in a distributed real-time system can be fulllled up to any degree of co...
متن کاملAn Adaptive Information Dispersal Algorithm for Time-critical Reliable Communication
AIDA { a novel elaboration on Michael O. Rabin's IDA 21] { is a communication protocol that uses redundancy to achieve both timeliness and reliability. In AIDA redundancy is used to tackle several crucial problems. In particular, redundancy is used to tolerate failures, to increase the likelihood of meeting tight time-constraints, and to ration (based on task priorities) the limited bandwidth i...
متن کاملAIDA-based real-time fault-tolerant broadcast disks
The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the significant asymmetry between downstream and upstream communication capacities, and the significant disparity between server and client storage capacities. Recent work proposed the use of Broadcast Disks as a scalable mechanism to deal with ...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کامل